Refining Sparse Coding Sub-word Unit Inventories with Lattice-constrained Viterbi Training
نویسندگان
چکیده
منابع مشابه
Refining Word Alignment with Discriminative Training
The quality of statistical machine translation systems depends on the quality of the word alignments that are computed during the translation model training phase. IBM alignment models, as implemented in the GIZA++ toolkit, constitute the de facto standard for performing these computations. The resulting alignments and translation models are however very noisy, and several authors have tried to...
متن کاملLearning Word Representations with Hierarchical Sparse Coding
We propose a new method for learning word representations using hierarchical regularization in sparse coding inspired by the linguistic study of word meanings. We show an efficient learning algorithm based on stochastic proximal methods that is significantly faster than previous approaches, making it possible to perform hierarchical sparse coding on a corpus of billions of word tokens. Experime...
متن کاملA Constrained Viterbi Relaxation for Bidirectional Word Alignment
Bidirectional models of word alignment are an appealing alternative to post-hoc combinations of directional word aligners. Unfortunately, most bidirectional formulations are NP-Hard to solve, and a previous attempt to use a relaxationbased decoder yielded few exact solutions (6%). We present a novel relaxation for decoding the bidirectional model of DeNero and Macherey (2011). The relaxation ca...
متن کاملSparse Dissimilarity-constrained Coding for Glaucoma Screening.dvi
Objective: Glaucoma is an irreversible chronic eye disease that leads to vision loss. As it can be slowed down through treatment, detecting the disease in time is important. However, many patients are unaware of the disease because it progresses slowly without easily noticeable symptoms. Currently, there is no effective method for low cost population-based glaucoma detection or screening. Recen...
متن کاملIdeal Code Constrained Supervised Sparse Coding
In this paper, we proposed a novel sparse coding algorithm by using the class labels to constrain the learning of codebook and sparse code. We not only use the class label to train the classifier, but also use it to construct class conditional codewords to make the sparse code as discriminative as possible. We first construct ideal sparse codes with regarding to the class conditional codewords,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.04.034